Discrete Approximation of Unbounded Operators and Approximation of their Spectra
نویسنده
چکیده
Let E be a Banach space over C and let the densely defined closed linear operator A: D(A) ... EQ E be discretely approximated by the sequence ((An, D(An)))n ¥N of operators An where each An is densely defined in the Banach space Fn. Let sa(A) be the approximate point spectrum of A and let se(An) denote the e-pseudospectrum of An. Generalizing our own result, we show that sa(A) ... lim inf se(An)=1n ¥N 4k \ n se(Ak) holds for every e > 0. We deduce that then for every compact set K ... C limn dist(sa(A) 5K, sa(An))=0 provided there exists M> 0 such that ||(l−An)|| [M dist(l, s(An)) holds for every n and every l in the resolvent set r(An) of An. We finally treat the problem under which conditions sa(A) can be approximated from below. More precisely we investigate the problem: Under which assumptions does 4 e > 0 4n ¥N 1k \ n se, a(Ak) ... sa(A) hold where se, a(A) denotes the e-approximate pseudospectrum? © 2001 Elsevier Science
منابع مشابه
Investigation of extinction spectra of THTS Mn thin films and comparsion with discrete dipole approximation simulation results
In this work, the extinction spectra of the nano-structure of the Tilt Helical and Stair-like Towers of Mn thin films were obtained using discrete dipole approximation (DDA) simulation for both s-and p-polarization at two incident light angles of 10°, and 60° at different azimuthal angles for the there samples with different tilt. Obtained results are compared with the experimental optical exti...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملOn the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators
In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملApproximation by $(p,q)$-Lupac{s} Stancu Operators
In this paper, $(p,q)$-Lupas Bernstein Stancu operators are constructed. Statistical as well as other approximation properties of $(p,q)$-Lupac{s} Stancu operators are studied. Rate of statistical convergence by means of modulus of continuity and Lipschitz type maximal functions has been investigated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 113 شماره
صفحات -
تاریخ انتشار 2001